On the Value of Binary Expansions for General Mixed-Integer Linear Programs
نویسندگان
چکیده
We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our theoretical results.
منابع مشابه
Inequalities and Target Objectives for Metaheuristic Search - Part I: Mixed Binary Optimization
Recent adaptive memory and evolutionary metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide the search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values, and in strategies that use linear programming to generate trial solu...
متن کاملTight Polyhedral Representations of Discrete Sets Using Projections, Simplices, and Base-2 Expansions
This research effort focuses on the acquisition of polyhedral outer-approximations to the convex hull of feasible solutions for mixed-integer linear and mixed-integer nonlinear programs. The goal is to produce desirable formulations that have superior size and/or relaxation strength. These two qualities often have great influence on the success of underlying solution strategies, and so it is wi...
متن کاملColumn-Generation for Capacity-Expansion Planning of Electricity Distribution Networks
We present a stochastic model for capacity-expansion planning of electricity distribution networks subject to uncertain demand (CEP). We formulate CEP as a multistage stochastic mixed-integer program with a scenario-tree representation of uncertainty. At each node of the scenario-tree, the model determines capacity-expansions, operating con guration, and power ows. A super-arc representation ...
متن کاملGeneration of a reduced first - level mixed integer programmimg problem
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
متن کاملLearning-Based Energy Management System for Scheduling of Appliances inside Smart Homes
Improper designs of the demand response programs can lead to numerous problems such as customer dissatisfaction and lower participation in these programs. In this paper, a home energy management system is designed which schedules appliances of smart homes based on the user’s specific behavior to address these issues. Two types of demand response programs are proposed for each house which are sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 50 شماره
صفحات -
تاریخ انتشار 2002